Some Notes on Minimal Self–Centered Graphs
نویسنده
چکیده
A graph is called self–centered if all of its vertices have the same eccentricity. We prove some new properties of such graphs and obtain all minimal self–centered graphs of up to 10 vertices.
منابع مشابه
A characterization for 2-self-centered graphs
A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their compliments. Then we split characterizing edge-minimal 2-self-centered graphs into two cases. First, we characterize edge-minimal 2-self-centered graphs without triangles by introducing intersecting bi-i...
متن کاملWiener Index of Graphs in Terms of Eccentricities
The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملCompletion and decomposition of hypergraphs into dominating sets of graphs
The collection of the vertex dominating sets of a graph defines a hypergraph on the set of vertices of the graph. However, there are hypergraphs H that are not the collection of the vertex dominating sets of any graph. This paper deals with the question of completing these hypergraphs H to the vertex dominating sets of some graphs G. We demonstrate that such graphs G exist and, in addition, we ...
متن کاملOn some simplicial elimination schemes for chordal graphs
We introduced here an interesting tool for the structural study of chordal graphs, namely the Reduced Clique Graph. Using some of its combinatorial properties we show that for any chordal graph we can construct in linear time a simplicial elimination scheme starting with a pending maximal clique attached via a minimal separator maximal under inclusion among all minimal separators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010